Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
581	On the Complexity of Numerical Analysis Eric Allender Rutgers, the State University of NJ Department of Computer Science Piscataway, NJ, USA Add to Reading List Source URL: ftp.cs.rutgers.edu Language: English - Date: 2008-12-08 14:23:03 Complexity classes Polynomial Advice P Reduction Time complexity Bounded-error probabilistic polynomial Circuit complexity Theoretical computer science Computational complexity theory Applied mathematics
582	Complexity of 10 Decision Problems in Continuous Time Dynamical Systems Amir Ali Ahmadi IBM Watson Research Center Anirudha Majumdar MIT Add to Reading List Source URL: web.mit.edu Language: English - Date: 2013-06-23 10:21:36 Dynamical systems Stability theory Lyapunov function Lyapunov stability Quadratic Polynomial P versus NP problem Time complexity Lyapunov theory Theoretical computer science Mathematics Computational complexity theory
583	Paradox Issue 2, 2003 The Magazine of the Melbourne University Mathematics and Statistics Society Joe Healy Add to Reading List Source URL: www.ms.unimelb.edu.au Language: English - Date: 2011-11-19 03:23:12 Complexity classes Mathematical optimization W. B. R. Lickorish P versus NP problem Travelling salesman problem Time complexity NP Knot theory P Theoretical computer science Computational complexity theory Applied mathematics
584	CCCG 2011, Toronto ON, August 10–12, 2011 Robust approximate assembly partitioning Elisha Sacks∗ Victor Milenkovic† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Analysis of algorithms Computational complexity theory Convex geometry Digital geometry Minkowski addition Algorithm Time complexity Mathematics Theoretical computer science Geometry
585	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A PTAS for the continuous 1.5D Terrain Guarding Problem Stephan Friedrichs∗ Michael Hemmer∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-28 18:32:50 Group theory Order Optimization problem NP-complete problems Network flow Combinatorial optimization Theoretical computer science Mathematics Computational complexity theory
586	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
587	Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:53 Complexity classes Probabilistic complexity theory Quantum complexity theory Analysis of algorithms Randomized algorithm PP NP P Theoretical computer science Computational complexity theory Applied mathematics
588	CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Largest empty rectangle Algorithm Closest pair of points problem Reduction Computer science Computational geometry Beta skeleton Mathematics Applied mathematics Computational complexity theory
589	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Computational complexity and an integer programming model of Shakashaka Erik D. Demaine∗ Yoshio Okamoto† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:59 Operations research Convex optimization Linear programming Regression analysis NP-complete problems 2-satisfiability Dynamic programming Mathematics Mathematical optimization Theoretical computer science
590	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Time, space, and precision: Revisiting classic problems in computational geometry with degree-driven analysis Jack Snoeyink∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-04 14:37:40 Analysis of algorithms Computational complexity theory Computer arithmetic Algorithm Mathematical logic Floating point Computational geometry Time complexity Model of computation Theoretical computer science Applied mathematics Computer science

UPDATE